Exact algorithms for size constrained 2-clustering in the plane
نویسندگان
چکیده
منابع مشابه
Size-constrained 2-clustering in the plane with Manhattan distance
We present an algorithm for the 2-clustering problem with cluster size constraints in the plane assuming `1-norm, that works in O(n logn) time and O(n) space. Such a procedure also solves a full version of the problem, computing the optimal solutions for all possible constraints on cluster sizes. The algorithm is based on a separation result concerning the clusters of any optimal solution of th...
متن کاملRepeated Record Ordering for Constrained Size Clustering
One of the main techniques used in data mining is data clustering, which has many applications in computer science, biology, and social sciences. Constrained clustering is a type of clustering in which side information provided by the user is incorporated into current clustering algorithms. One of the well researched constrained clustering algorithms is called microaggregation. In a microaggreg...
متن کاملExact Algorithms for Multi-Constrained QoS Routing
The modern network service of finding a feasible or an optimal path subject to multiple constraints on performance metrics such as delay, jitter, loss probability, etc. gives rise to the multi-path constrained (MCP) or multi-constrained optimal-path (MCOP) QoS routing problems, which are NP-complete. In this paper, these problems are solved through exact algorithms. Even though exact algorithms...
متن کاملExact Algorithms for the Chance-Constrained Vehicle Routing Problem
We study the chance-constrained vehicle routing problem (CCVRP), a version of the vehicle routing problem (VRP) with stochastic demands, where a limit is imposed on the probability that each vehicle’s capacity is exceeded. A distinguishing feature of our proposed methodologies is that they allow correlation between random demands, whereas nearly all existing exact methods for the VRP with stoch...
متن کاملSize constrained clustering problems in fixed dimension
Clustering or cluster analysis [1] is a classical method in unsupervised learning and one of the most used techniques in statistical data analysis. Clustering has a wide range of applications in many areas like pattern recognition, medical diagnostics, data mining, biology, market research and image analysis among others. A cluster is a set of data points that in some sense are similar to each ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2016
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.10.005